A 43 Integers 14 ( 2014 ) on Double 3 - Term Arithmetic Progressions
نویسندگان
چکیده
In this note we are interested in the problem of whether or not every increasing sequence of positive integers x1x2x3 · · · with bounded gaps must contain a double 3-term arithmetic progression, i.e., three terms xi, xj , and xk such that i+ k = 2j and xi+xk = 2xj . We consider a few variations of the problem, discuss some related properties of double arithmetic progressions, and present several results obtained by using RamseyScript, a high-level scripting language.
منابع مشابه
On rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملOn Double 3-term Arithmetic Progressions
In this note we are interested in the problem of whether or not every increasing sequence of positive integers x1x2x3 · · · with bounded gaps must contain a double 3-term arithmetic progression, i.e., three terms xi, x j, and xk such that i+k = 2 j and xi+xk = 2x j. We consider a few variations of the problem, discuss some related properties of double arithmetic progressions, and present severa...
متن کاملA 43 INTEGERS 12 ( 2012 ) ARITHMETIC PROGRESSIONS IN THE POLYGONAL NUMBERS Kenneth
In this paper, we investigate arithmetic progressions in the polygonal numbers with a fixed number of sides. We first show that four-term arithmetic progressions cannot exist. We then describe explicitly how to find all three-term arithmetic progressions. Finally, we show that not only are there infinitely many three-term arithmetic progressions, but that there are infinitely many three-term ar...
متن کاملThe Minimal Number of Three-Term Arithmetic Progressions Modulo a Prime Converges to a Limit
How few three-term arithmetic progressions can a subset S ⊆ ZN := Z/NZ have if |S| ≥ υN? (that is, S has density at least υ). Varnavides [4] showed that this number of arithmetic-progressions is at least c(υ)N for sufficiently large integers N ; and, it is well-known that determining good lower bounds for c(υ) > 0 is at the same level of depth as Erdös’s famous conjecture about whether a subset...
متن کاملOn Arithmetic Progressions in Sums of Sets of Integers
3 Proof of Theorem 1 9 3.1 Estimation of the g1 term. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 3.2 Estimation of the g3 term. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.3 Estimation of the g2 term. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.4 Putting everything together. . . . . . . . . . . . . . . . . . . . . ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014